Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

Robust skin detection in real-world images

Human skin detection in images is desirable in many practical applications, e.g., human–computer interaction and adult-content filtering. However, existing methods are mainly suffer from confusing backgrounds in real-world images. In this paper, we try to address this issue by exploring and combining several human skin properties, i.e. color property, texture property and region property. First, images are divided into superpixels, and robust skin seeds and background seeds are acquired through color property and texture property of skin. Then we combining color, region and texture properties of skin by proposing a novel skin color and texture based graph cuts (SCTGC) to acquire the final skin detection results. Comprehensive and comparative experiments show that the proposed method achieves promising performance and outperforms many state-of-the-art methods over publicly available challenging datasets with a great part of hard images.     

基于双向位图的CSR大规模图存储优化

大数据时代,Graph500是评测超级计算机处理数据密集型应用能力的重要工具,E级验证系统的图遍历处理能力主要受限于内存空间和访存带宽,尤其是内存空间利用率直接决定了图的测试规模和测试性能.针对天河E级验证系统小内存特征,提出了基于双向位图的大规模图数据压缩存储方法(bidirectional-bitmap based CSR,Bi-CSR),Bi-CSR在CSR矩阵压缩的基础上引入行方向位图和列方向位图协同完成稀疏矩阵压缩存储,行方向位图主要负责行方向位图的压缩存储与索引,列方向位图除了进一步压缩图存储空间,还负责为顶点遍历向量并行优化提供加速空间.Bi-CSR大幅度减少了稀疏矩阵存储空间.面向天河E级验证系统,当图输入规模为237时,Graph500的图存储空间节约效率接近70%,全系统稳定测试性能为2.131E+12TEPS,性能最大加速比超过100倍.     

Discriminative graph convolution networks for hyperspectral image classification

Recently, the proposal of graph convolutional networks (GCN) has successfully implemented into hyperspectral image data representation and analysis. In spite of the great success, there are still several major challenges in hyperspectral image classification, including within-class diversity, and between-class similarity, which generally degenerate hyperspectral image classification performance. To address the problems, we propose a discriminative graph convolution networks (DGCN) for hyperspectral image classification. This method introduces the concepts of within-class scatter and between-class scatter, which respectively reflect the global geometric structure and discriminative information of the input space. The experimental results on the hyperspectral data sets show that the proposed method has good classification performance.     

FarsBase-KBP: A knowledge base population system for the Persian Knowledge Graph

While most of the knowledge bases already support the English language, there is only one knowledge base for the Persian language, known as FarsBase, which is automatically created via semi-structured web information. Unlike English knowledge bases such as Wikidata, which have tremendous community support, the population of a knowledge base like FarsBase must rely on automatically extracted knowledge. Knowledge base population can let FarsBase keep growing in size, as the system continues working. In this paper, we present a knowledge base population system for the Persian language, which extracts knowledge from unlabelled raw text, crawled from the Web. The proposed system consists of a set of state-of-the-art modules such as an entity linking module as well as information and relation extraction modules designed for FarsBase. Moreover, a canonicalization system is introduced to link extracted relations to FarsBase properties. Then, the system uses knowledge fusion techniques with minimal intervention of human experts to integrate and filter the proper knowledge instances, extracted by each module. To evaluate the performance of the presented knowledge base population system, we present the first gold dataset for benchmarking knowledge base population in the Persian language, which consisting of 22015 FarsBase triples and verified by human experts. The evaluation results demonstrate the efficiency of the proposed system.     

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation,a Benders decomposition and a CP-based algorithm

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free; (ii) there is an upper bound on the number of times an item type may appear in the cutting pattern; (iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.     

A novel function-structure concept network construction and analysis method for a smart product design system

The rapid growth of data and the requirement of designers to track massive data to obtain design stimuli have posed challenges to conceptual design, thereby promoting the development of data-driven design. Concept networks precisely capture design information from a large volume of unstructured and heterogeneous textual data and saliently decrease time and labor cost for designers to read texts, which creates new opportunities for developing a smart product design system. To advance data-driven design, this study proposes the novel function-structure concept network (FSCN) construction method, which combines sentence parsing and word/phrase extraction to integrate functional and structural information. Furthermore, a network analysis method is proposed to explore design information associations that contain both explicit and implicit associations together and thereby recommend them simultaneously to designers as inspirational stimuli to support design ideation. This approach can enhance designers' capabilities to build associations between design information, conceive new design ideas during conceptual design, and increase creativity for solving design problems. The proposed FSCN construction and analysis method can be used as an auxiliary tool to visualize associations among design information so as to inspire idea generation in the early stage of conceptual design. An illustrative example was used to validate the practicability of the proposed methodology. The code of the proposed method is available at https://github.com/KWflyer/FSCN.     

空间句法：从图论的角度看中微观城市形态

如何从整体的角度研究城市形态的复杂性？空间句法在城市形态领域中关注城市形态空间之间的整体联系，运用图论的数学理论和方法建立了城市形态的模型，发现了不同城市具有相似的城市空间拓扑关系，以及特定城市空间之间复杂的整体关联在很大程度上决定了中微观层面的人车流和用地的分布，给城市形态复杂性研究提供了坚实可行的理论基础和方法程序、也给整合交通规划和用地规划的城市规划和设计提供了一种具体的实践角度。本文简要回顾了城市形态研究中关于要素和关联的研究发展、详细解释了空间句法从图论的角度研究城市形态的整体关联，最后分析了空间句法在伯明翰Brindleypalce案例中的应用。     

基于视频多目标跟踪的高度测量算法

本文提出了一种基于视频多目标跟踪的高度测量算法.首先,采用码本模型检测前景,利用图割理论实现对多目标的跟踪.然后,提取每一帧中目标的头部特征点和脚部特征点,根据投影几何的约束关系计算每个目标的高度.最后,融合多帧的测量结果进行数据优化.本文提出的算法不需要对相机进行完全标定,只需计算摄像机的灭点和地平面的灭线,降低了计算的复杂度.实验结果表明,本文提出的算法具有较高的测量精度,对遮挡和运动状态变化具有较强的鲁棒性,同时,能够满足实时性要求.